Population Monotonic and Strategy-proof Mechanisms Respecting Welfare Lower Bounds∗

نویسنده

  • Duygu Yengin
چکیده

The significance of population monotonicity and welfare bounds is well-recognized in the fair division literature. We characterize population monotonic and incentive compatible mechanisms which allocate the goods efficiently and respect a welfare lower bound chosen in the fair allocation problem of allocating collectively owned indivisible goods or bads when monetary transfers are possible and preferences are private information. We consider the welfare bounds that are central to the fair allocation literature, namely, the identical-preferences lower-bound, individual rationality, the stand-alone lower-bound, and −fairness. We also compare the strength and associated budget deficits of and the logical relations between the aforementioned lower bounds. JEL Classifications: C79, D61, D63.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tighter Bounds for Facility Games

In facility games, public facilities are placed based on the reported locations of the agents. The cost of an agent is measured by the distance from its location to the nearest facility. In this paper, we consider the one dimensional facility games where all locations for agents and the facilities are on the real line. We study the approximation ratio of social welfare for strategy-proof mechan...

متن کامل

Proof Complexity of Propositional Default Logic

Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic. In this paper we examine these calculi from a proof-complexity perspective. In particular, we show that the calculus for credulous reasoning obeys almost the same bou...

متن کامل

Domains, ranges and strategy-proofness: the case of single-dipped preferences

We characterize the set of all individual and group strategy-proof rules on the domain of all single-dipped preferences on a line. For rules defined on this domain, and on several of its subdomains, we explore the implications of these strategy-proofness requirements on the maximum size of the rules’ range. We show that when all single-dipped preferences are admissible, the range must contain t...

متن کامل

Welfare lower bounds and strategy-proofness in the queueing problem

We investigate the implications of welfare lower bounds together with queue-effi ciency and strategyproofness in the context of the queueing problem. As a consequence, we provide alternative characterizations of the k-pivotal mechanisms (Mitra and Mutuswami [13]). First, we introduce the k-welfare lower bound, which ensures that no agent is worse off than the case where she is assigned to the k...

متن کامل

Pareto Efficient Strategy-proof School Choice Mechanism with Minimum Quotas and Initial Endowments

This paper develops a strategy-proof and Pareto efficient mechanism for a school choice program called Top Trading Cycles among Representatives with Supplementary Seats (TTCR-SS). We consider a setting where minimum quotas are imposed for each school, i.e., a school is required to be assigned at least a certain number of students to operate, and the obtained matching must respect initial endowm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011